The Terwilliger algebra of the incidence graphs of Johnson geometry, II
نویسندگان
چکیده
In 2007, Levstein and Maldonado computed the Terwilliger algebra of the Johnson graph J(n,m) when 3m 6 n. It is well known that the halved graphs of the incidence graph J(n,m,m + 1) of Johnson geometry are Johnson graphs. In this paper, we determine the Terwilliger algebra of J(n,m,m + 1) when 3m 6 n, give two bases of this algebra, and calculate its dimension.
منابع مشابه
Symmetries of Graphs and Networks
Symmetric graphs of diameter 2 with complete normal quotients Carmen Amarra University of Western Australia, Australia [email protected] A graph has diameter 2 if it is not a complete graph and if every pair of nonadjacent vertices is joined by a path of length 2. Our general problem is to examine the overall structure of graphs which are both arc-transitive and of diameter 2 using norm...
متن کاملThe Terwilliger algebra of the Johnson schemes
One of the classical families of association schemes is known as the Johnson schemes J (n, d). In this paper we compute the Terwilliger algebra associated to them when 3d n. We give its decomposition into simple ideals and the decomposition of its standard module into irreducible submodules. © 2006 Elsevier B.V. All rights reserved.
متن کاملTriple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کاملDistance-regular graphs of q-Racah type and the q-tetrahedron algebra
In this paper we discuss a relationship between the following two algebras: (i) the subconstituent algebra T of a distance-regular graph that has q-Racah type; (ii) the q-tetrahedron algebra ⊠q which is a q-deformation of the three-point sl2 loop algebra. Assuming that every irreducible T -module is thin, we display an algebra homomorphism from ⊠q into T and show that T is generated by the imag...
متن کامل1-Homogeneous Graphs with Cocktail Party -Graphs
Let be a graph with diameter d ≥ 2. Recall is 1-homogeneous (in the sense of Nomura) whenever for every edge xy of the distance partition {{z ∈ V ( ) | ∂(z, y) = i, ∂(x, z) = j} | 0 ≤ i, j ≤ d} is equitable and its parameters do not depend on the edge xy. Let be 1-homogeneous. Then is distance-regular and also locally strongly regular with parameters (v′, k′, λ′, μ′), where v′ = k, k′ = a1, (v′...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 20 شماره
صفحات -
تاریخ انتشار 2013